Extension Field for Xate Pairing with Freeman Curve
نویسندگان
چکیده
In recent years, pairing-based cryptographies such as ID-based cryptography [1] and group signature [2] have been studied. For their implementations, pairings such as Weil pairing [1], Tate pairing, Ate pairing [3] and Xate pairing [4] have been used. In order to implement these pairings, several kinds of ordinary pairing-friendly curves such as Miyaji-Nakabayashi-Takano (MNT) curve [5], Barreto-Naehrig (BN) curve [6] and Freeman curve [7, 8] have been proposed. As the definition field of these curves, many researchers use optimal extension field (OEF) [9] because OEF carries out arithmetic operations efficiently. However, it is known that OEF is not available for the definition field of Freeman curve due to the condition of OEF. Our previous work namely Type I-X all one polynomial field (AOPF) [11] is available for the definition field of Freeman curve. Type I-X AOPF can carry out arithmetic operations as efficient as OEF. In this paper, the authors consider how to constructed type I-X AOPF and optimize a multiplication algorithm for Xate pairing with Freeman curve. Additionally, this paper shows some experimental results of Xate pairing with Freeman curve defined over the type
منابع مشابه
Efficient Squaring Algorithm for Xate Pairing with Freeman Curve
Recently, pairing–based cryptographies have attracted much attention. For fast pairing calculation, not only pairing algorithms but also arithmetic operations in extension field should be efficient. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper proposes an efficient squaring algorithm in extension field for Freema...
متن کاملHow to construct pairing-friendly curves for the embedding
Pairing based cryptography is a new public key cryptographic scheme. The most popular one is constructed by using the Weil pairing of elliptic curves. For a large prime ` which devides E(Fq), a subgroup G generated by Fq-rational point P of order l is embedded into Fqk by using the Weil pairing for some positive integer k. Pairing-friendly curves are required to have appropriately large q and `...
متن کاملConstructing pairing-friendly hyperelliptic curves using Weil restriction
A pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding degree with respect to a large prime-order subgroup. In this paper we construct pairing-friendly genus 2 curves over finite fields Fq whose Jacobians are ordinary and simple, but not absolutely simple. We show that constructing such curves is equivalent to constructing elliptic curves over Fq that become ...
متن کاملGenus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions
The use of elliptic and hyperelliptic curves in cryptography relies on the ability to compute the Jacobian order of a given curve. Recently, Satoh proposed a probabilistic polynomial time algorithm to test whether the Jacobian – over a finite field Fq – of a hyperelliptic curve of the form Y 2 = X + aX + bX (with a, b ∈ Fq) has a large prime factor. His approach is to obtain candidates for the ...
متن کاملOn Efficient Pairings on Elliptic Curves over Extension Fields
In implementation of elliptic curve cryptography, three kinds of finite fields have been widely studied, i.e. prime field, binary field and optimal extension field. In pairing-based cryptography, however, pairingfriendly curves are usually chosen among ordinary curves over prime fields and supersingular curves over extension fields with small characteristics. In this paper, we study pairings on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009